Testing Polynomial Equivalence by Scaling Matrices
نویسندگان
چکیده
منابع مشابه
Operator Scaling via Geodesically Convex Optimization, Invariant Theory and Polynomial Identity Testing
We propose a new second-order method for geodesically convex optimization on the natural hyperbolic metric over positive de nite matrices. We apply it to solve the operator scaling problem in time polynomial in the input size and logarithmic in the error. This is an exponential improvement over previous algorithms which were analyzed in the usual Euclidean, commutative metric (for which the abo...
متن کاملInfinite elementary divisor structure-preserving transformations for polynomial matrices
The main purpose of this work is to propose new notions of equivalence between polynomial matrices, that preserve both the finite and infinite elementary divisor structure. The approach we use is twofold : a) the ”homogeneous polynomial matrix approach” where in place of the polynomial matrices, we study their homogeneous polynomial matrix forms and use 2-D equivalence transformations in order ...
متن کاملStructural Stability of Polynomial Matrices Related to Linear Time-Invariant Singular Systems
We consider the set of quadruples of matrices defining singular linear time-invariant dynamical systems and show that there is a one-to-one correspondence between this set and a subset of the set of polynomial matrices of degree two. This correspondence preserves the equivalence relations introduced in both sets (feedback-similarity and strict equivalence): two quadruples of matrices are feedba...
متن کاملThe Complexity of Verifying the Characteristic Polynomial and Testing Similarity
We investigate the computational complexity of some important problems in linear algebra. 1. The problem of verifying the characteristic polynomial of a matrix is known to be in the complexity class C=L (Exact Counting in Logspace). We show that it is complete for C=L under logspace many-one reductions. 2. The problem of deciding whether two matrices are similar is known to be in the complexity...
متن کاملUnlabeled equivalence for matroids representable over finite fields
Two r × n matrices A and A′ representing the same matroid M over GF (q), where q is a prime power, are projective equivalent representations of M if one can be obtained from the other by elementary row operations and column scaling. Bounds for projective inequivalence are difficult to obtain and are known for only a few special classes of matroids. In this paper we define two matrices A and A′ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017